Fast Point Multiplication on Elliptic Curves of Even Order
نویسندگان
چکیده
Every elliptic curve of even order over a finite field of characteristic > 3 is birationally equivalent to a curve in the Jacobi quartic form. In this paper, new explicit formulae for group operations on a Jacobi quartic curve are presented. The algorithm for doubling uses only 1M +6S, for the mixed-addition uses only 8M + 2S and the unified addition formula only 9M + 2S to the best case. For elliptic curve of even order, these algorithm are more efficient than the other algorithms in the literature.
منابع مشابه
Ranks of Elliptic Curves with Prescribed Torsion over Number Fields
We study the structure of the Mordell–Weil group of elliptic curves over number fields of degree 2, 3, and 4. We show that if T is a group, then either the class of all elliptic curves over quadratic fields with torsion subgroup T is empty, or it contains curves of rank 0 as well as curves of positive rank. We prove a similar but slightly weaker result for cubic and quartic fields. On the other...
متن کاملFast point multiplication on Koblitz curves: Parallelization method and implementations
Point multiplication is required in every elliptic curve cryptosystem and its efficient implementation is essential. Koblitz curves are a family of curves defined over F2m allowing notably faster computation. We discuss implementation of point multiplication on Koblitz curves with parallel field multipliers. We present a novel parallelization method utilizing point operation interleaving. FPGA ...
متن کاملFaster point scalar multiplication on NIST elliptic curves over GF(p) using (twisted) Edwards curves over GF(p³)
In this paper we present a new method for fast scalar multiplication on el-liptic curves over GF (p) in FPGA using Edwards and twisted Edwards curves over GF (p 3). The presented solution works for curves with prime group order (for example for all NIST curves over GF (p)). It is possible because of using 2-isogenous twisted Edwards curves over GF (p 3) instead of using short Weierstrass curves...
متن کاملJacobi Quartic Curves Revisited
This paper provides new results about efficient arithmetic on (extended) Jacobiquartic form elliptic curves y = dx + 2ax + 1. Recent works have shown thatarithmetic on an elliptic curve in Jacobi quartic form can be performed solidly fasterthan the corresponding operations in Weierstrass form. These proposals use up to 7coordinates to represent a single point. However, fast scal...
متن کاملFast Point Multiplication on Elliptic Curves through Isogenies
Elliptic curve cryptosystems are usually implemented over fields of characteristic two or over (large) prime fields. For large prime fields, projective coordinates are more suitable as they reduce the computational workload in a point multiplication. In this case, choosing for parameter a the value −3 further reduces the workload. Over Fp, not all elliptic curves can be rescaled through isomorp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2007 شماره
صفحات -
تاریخ انتشار 2007